Lower Bounds for OBDDs and Nisan's pseudorandom generator
نویسندگان
چکیده
منابع مشابه
18.405J S16 Lecture 22: Derandomization Implies Circuit Lower Bounds
Q: Why are we using circuit lower bounds here, as opposed to a claim such as E ̸⊆ P for example? A: The proof of the Nisan-Wigderson pseudorandom generator relies on nonuniformity, by showing that distinguishing a pseudorandom generator implies a circuit for solving a hard problem – this reduction involves hardwiring advice into a circuit in order to solve the hard problem. A contradiction requi...
متن کاملAdvanced Complexity Theory Fall 2012 Lecture 15 — November 1 , 2012
Q: Why are we using circuit lower bounds here, as opposed to a claim such as E ̸⊆ P for example? A: The proof of the Nisan-Wigderson pseudorandom generator relies on nonuniformity, by showing that distinguishing a pseudorandom generator implies a circuit for solving a hard problem – this reduction involves hardwiring advice into a circuit in order to solve the hard problem. A contradiction requi...
متن کاملLower Bounds for Circuits with Few Modular Gates using Exponential Sums
AC 0 circuits of size n log n augmented with log n MODm gates, for every odd integer m and any sufficiently small . As a consequence, for every odd integer m, we obtain a pseudorandom generator, based on the MOD2 function, for circuits of size S containing log S MODm gates. Our results are based on recent bounds of exponential sums that were previously introduced for proving lower bounds for MA...
متن کاملSpace Pseudorandom Generators by Communication Complexity Lower Bounds
In 1989, Babai, Nisan and Szegedy [BNS92] gave a construction of a pseudorandom generator for logspace, based on lower bounds for multiparty communication complexity. The seed length of their pseudorandom generator was 2 √ , because the best lower bounds for multiparty communication complexity are relatively weak. Subsequently, pseudorandom generators for logspace with seed length O(log n) were...
متن کاملImproved Lower Bounds for the Discrepancy of Inversive Congruential Pseudorandom Numbers
The inversive congruential method with prime modulus for generating uniform pseudorandom numbers is studied. Lower bounds for the discrepancy of k-tuples of successive pseudorandom numbers are established, which improve earlier results of Niederreiter. Moreover, the present proof is substantially simpler than the earlier one.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 8 شماره
صفحات -
تاریخ انتشار 2001